Browsing by Subject "Random permutations"
Now showing items 1-1 of 1
-
Article
Efficient gossip and robust distributed computation
(2003)This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T = O(log2 p) and message complexity M = O(p1+ε), for any ε > ...